Borel Sets and Countable Models
نویسندگان
چکیده
We show that certain families of sets and functions related to a countable structure A are analytic subsets of a Polish space. Examples include sets of automorphisms, endomorphisms and congruences of A and sets of the combinatorial nature such as coloring of countable plain graphs and domino tiling of the plane. This implies, without any additional set-theoretical assumptions, i.e., in ZFC alone, that cardinality of every such uncountable set is 2א0 .
منابع مشابه
Smooth Sets for a Borel Equivalence Relation
We study some properties of smooth Borel sets with respect to a Borel equivalence relation, showing some analogies with the collection of countable sets from a descriptive set theoretic point of view. We found what can be seen as an analog of the hyperarithmetic points in the context of smooth sets. We generalize a theorem of Weiss from Z-actions to actions by arbitrary countable groups. We sho...
متن کاملA dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2 is a Gδσ-set then either B is countable or B contains a perfect subset. Second, we prove that if 2 is the countable union of countable sets, then there exists an Fσδ set C ⊆ 2 such that C is uncountable but contains no perfect subset. Finally, we c...
متن کاملA New Notion of Cardinality for Countable First Order Theories
We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Φ|| for sentences Φ of Lω1,ω, which counts the number of sentences of L∞,ω that, in some forcing extension, become a canonical Scott sentence of a model of Φ. We show this card...
متن کاملUniformity, Universality, and Computability Theory
We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened ...
متن کاملF U N D a M E N T a Mathematicae 164 (2000) Borel and Baire Reducibility
We prove that a Borel equivalence relation is classifiable by countable structures if and only if it is Borel reducible to a countable level of the hereditarily countable sets. We also prove the following result which was originally claimed in [FS89]: the zero density ideal of sets of natural numbers is not classifiable by countable structures. Introduction. The Borel reducibility theory of Pol...
متن کامل